A decidable theory of nitely-layered metric temporal structures
نویسنده
چکیده
We study the decidability problem for metric and layered temporal logics. The logics we consider are suitable to model time granularity in various contexts, and they allow one to build granular temporal models by referring to thènatural scale' in any component of the model and by properly constraining the interactions between diierently-grained components. A monadic second-order language combining operators such as temporal contextualization and projection, together with the usual displacement operator of metric temporal logics, is considered, and the theory of nitely-layered metric temporal structures is shown to be decidable.
منابع مشابه
Decidable theories of !-layered metric temporal structures
This paper focuses on decidability problems for metric and layered temporal logics which allow one to model time granularity in various contexts. The decidability of pure metric (non-granular) fragments and of metric temporal logics endowed with nitely many layers has been already proved by reduction to the decidability problem of the well-known theory S1S. In the present work, we prove the dec...
متن کاملDecidability Results for Metric and Layered Temporal Logics
We study the decidability problem for metric and layered temporal logics. The logics we consider are suitable to model time granularity in various contexts, and they allow one to build granular temporal models by referring to thènatural scale' in any component of the model and by properly constraining the interactions between diierently-grained components. A monadic second-order language combin...
متن کاملTheories of ! - Layered MetricTemporal
This paper focuses on decidability problems for metric and layered temporal logics. The considered logics|suitable to model time granularity in various contexts|allow one to build granular temporal models by referring to the natural scale in any component of the model and properly constraining the interactions between diierently grained components. We prove the decidability of both the theory o...
متن کاملThe Taming (Timing) of the States
Logic and computer science communities have traditionally followed a different approach to the problem of representing and reasoning about time and states. Research in logic resulted in a family of (metric) tense logics that take time as a primitive notion and define (timed) states as sets of atomic propositions which are true at given instants, while research in computer science concentrated o...
متن کاملMetric and Layered Temporal Logic for Time Granularity
This dissertation is about the design of temporal logics that deal with changing timegranularities. Time granularity can be de ned as the resolution power of the temporalquali cation of a statement. Providing a formalism with the concept of time granularitymakes it possible to specify time information with respect to di erently-grained temporaldomains. This does not merely m...
متن کامل